On an arithmetic function considered by Pillai
نویسندگان
چکیده
منابع مشابه
On an arithmetic function considered by Pillai
For every positive integer n let p(n) be the largest prime number p ≤ n. Given a positive integer n = n1, we study the positive integer r = R(n) such that if we define recursively ni+1 = ni − p(ni) for i ≥ 1, then nr is a prime or 1. We obtain upper bounds for R(n) as well as an estimate for the set of n whose R(n) takes on a fixed value k.
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولOn the Pullback of an Arithmetic Theta Function
In this paper, we consider the relation between the simplest types of arithmetic theta series, those associated to the cycles on the moduli space C of elliptic curves with CM by the ring of integers Ok in an imaginary quadratic field k, on the one hand, and those associated to cycles on the arithmetic surface M parametrizing 2-dimensional abelian varieties with an action of the maximal order OB...
متن کاملThe convolution inverse of an arithmetic function
Good, but does an inverse g of f have to exist? A necessary condition is that f(1) 6= 0. Indeed, if g is the inverse of f , then 1 = I(1) = (f ∗ g)(1) = f(1)g(1). We now show that this necessary condition is also sufficient. We assume that f(1) 6= 0 and we try and solve for g. What this means is that we are solving for infinitely many unknowns: g(1), g(2), . . . . From the above, we see that th...
متن کاملAn arithmetic function arising from Carmichael’s conjecture
Let φ denote Euler’s totient function. A century-old conjecture of Carmichael asserts that for every n, the equation φ(n) = φ(m) has a solution m 6= n. This suggests defining F (n) as the number of solutions m to the equation φ(n) = φ(m). (So Carmichael’s conjecture asserts that F (n) ≥ 2 always.) Results on F are scattered throughout the literature. For example, Sierpiński conjectured, and For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2009
ISSN: 1246-7405
DOI: 10.5802/jtnb.695